Permutation Bigraphs: An Analogue of Permutation Graphs
نویسندگان
چکیده
We introduce the class of permutation bigraphs as an analogue of permutation graphs. We show that this is precisely the class of bigraphs having Ferrers dimension at most 2. We also characterize the subclasses of interval bigraphs and indifference bigraphs in terms of their permutation labelings, and we relate permutation bigraphs to posets of dimension 2.
منابع مشابه
On bipartite powers of bigraphs
The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper, we investigate a bipartite analogue of graph powers, which we call bipartite powers of bigraphs. We show that the classes of bipartite permutation graphs and interval bigraphs are closed under taking bipartite power. We also show that the problem of recognizing bipartite powers is NP-complete...
متن کاملPermutation bigraphs and interval containments
A bipartite graph with partite sets X and Y is a permutation bigraph if there are two linear orderings of its vertices so that xy is an edge for x ∈ X and y ∈ Y if and only if x appears later than y in the first ordering and earlier than y in the second ordering. We characterize permutation bigraphs in terms of representations using intervals. We determine which permutation bigraphs are interva...
متن کاملF-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES
A permutation with no fixed points is called a derangement.The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.Let $G$ be a permutation group, a derangementgraph is one with vertex set $G$ and derangement set $mathcal{D}$ as connecting set. In this paper, we determine the spectrum of derangement graphs of order a product of three primes.
متن کامل